#define _CRT_SECURE_NO_WARNINGS 1
#include"BinarySaerchTree.h"
int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> t;
	for (auto e : a)
	{
		t.InsertR(e);
	}
	cout << t.Find(20);


	/*for (auto e : a)
	{
		t.EraseR(e);
	}*/
	t.mid_order();
	BSTree<int> t1 = t;
	BSTree<int> t2 (t);





	return 0;
}